Percolation games, probabilistic cellular automata, and the hard-core model

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Percolation Games, Probabilistic Cellular Automata, and the Hard-core Model

Let each site of the square lattice Z be independently declared closed with probability p, and otherwise open. Consider the following game: a token starts at the origin, and the two players take turns to move it from its current site x to an open site in {x + (0, 1), x + (1, 0)}; if both these sites are closed, then the player to move loses the game. Is there positive probability that the game ...

متن کامل

Percolation and Disorder-Resistance in Cellular Automata

We rigorously prove a form of disorder-resistance for a class of one-dimensional cellular automaton rules, including some that arise as boundary dynamics of two-dimensional solidification rules. Specifically, when started from a random initial seed on an interval of length L, with probability tending to one as L → ∞, the evolution is a replicator. That is, a region of space-time of density one ...

متن کامل

Around probabilistic cellular automata

We survey probabilistic cellular automata with approaches coming from combinatorics, statistical physics, and theoretical computer science, each bringing a different viewpoint. Some of the questions studied are specific to a domain, and some others are shared, most notably the ergodicity problem.

متن کامل

Probabilistic Cellular Automata

Cellular automata are binary lattices used for modeling complex dynamical systems. The automaton evolves iteratively from one configuration to another, using some local transition rule based on the number of ones in the neighborhood of each cell. With respect to the number of cells allowed to change per iteration, we speak of either synchronous or asynchronous automata. If randomness is involve...

متن کامل

Pattern Formation of the FitzHugh-Nagumo Model: Cellular Automata Approach

FitzHugh-Nagumo (FHN) model is a famous Reaction-Diffusion System which first introduced for the conduction of electrical impulses along a nerve fiber. This model is also considered as an abstract model for pattern formation. Here, we have used the Cellular Automata method to simulate the pattern formation of the FHN model. It is shown that the pattern of this model is very similar to those...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Probability Theory and Related Fields

سال: 2018

ISSN: 0178-8051,1432-2064

DOI: 10.1007/s00440-018-0881-6